Voronoï diagrams in projective geometry and sweep circle algorithms for constructing circle-based voronoï diagrams
نویسنده
چکیده
The sweep circle algorithm is based on the concept of wavefront developed by Dehne and Klein [Dehne, 1997]. In this case, because the sweep line is a site of the same nature as the sites being considered, we get an economy of scale for the objects to be treated. It uses the definition of a Voronoï diagram in projective geometry to simplify the treatment of the non-connected wavefront and vertex events. The paper gives an application of this kind of algorithm to the computation of a subtractively weighted Voronoï diagram. However the properties of the sweep circle algorithm in projective geometry can be used to construct other circle-based Voronoï diagrams and another application of these concepts is being developed for the construction of a Voronoï diagram of circles in Euclidean geometry.
منابع مشابه
Parallel computing 2D Voronoi diagrams using untransformed sweepcircles
Voronoi diagrams are among the most important data structures in geometric modeling. Among many efficient algorithms for computing 2D Voronoi diagrams, Fortune’s sweepline algorithm (Fortune, 1986 [5]) is popular due to its elegance and simplicity. Dehne and Klein (1987) [8] extended sweepline to sweepcircle and suggested computing a type of transformed Voronoi diagram, which is parallel in nat...
متن کاملOn the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres
In this paper we show an equivalence relationship between additively weighted Voronoi cells in R d, power diagrams in Rd and convex hulls of spheres in Rd. An immediate consequence of this equivalence relationship is a tight bound on the complexity of : (1) a single additively weighted Voronoi cell in dimension d; (2) the convex hull of a set of d-dimensional spheres. In particular, given a set...
متن کاملRounding Voronoi Diagram
Computational geometry classically assumes real-number arithmetic which does not exist in actual computers. A solution consists in using integer coordinates for data and exact arithmetic for computations. This approach implies that if the results of an algorithm are the input of another, these results must be rounded to match this hypothesis of integer coordinates. In this paper, we treat the c...
متن کاملDynamic Additively Weighted Voronoi Diagrams in 2D
In this paper we present a dynamic algorithm for the construction of the additively weighted Voronoi diagram of a set of weighted points on the plane. The novelty in our approach is that we use the dual of the additively weighted Voronoi diagram to represent it. This permits us to perform both insertions and deletions of sites easily. Given a set B of n sites, among which h sites have non-empty...
متن کاملUniversal Hyperbolic Geometry II : A pictorial overview
This article provides a simple pictorial introduction to universal hyperbolic geometry. We explain how to understand the subject using only elementary projective geometry, augmented by a distinguished circle. This provides a completely algebraic framework for hyperbolic geometry, valid over the rational numbers (and indeed any field not of characteristic two), and gives us many new and beautifu...
متن کامل